Convolutional Code Constructions Resulting in Maximal or near Maximal Free Distance - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

The Trellis Complexity of Convolutional Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Construction results for MDS-convolutional codes - International Symposium on Information Theory, 2000. Proceedings. IEEE

The generalized Singleton bound and MDS-convolutional codes are reviewed. For each n, k and 6 an elementary construction of rate k / n MDS convolutional codes of degree 6 is given.

Systematic Feed-Forward Convolutional Encoders Are Better than Other Encoders with an M-Algorithm Decoder

Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of enc...

Constructions of MDS-convolutional codes

Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...

Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)

-A search procedure is developed to find good short binary (N,N 1) convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distance dfrce either cannot achieve the maximum value or is equal to dfree of some code in the remaining set. Further, the search among the remaining codes is started in a subset in which we expect the possibilit...